A two-level domain decomposition algorithm for linear complementarity problem
نویسندگان
چکیده
منابع مشابه
Domain Decomposition Methods for a Complementarity Problem∗
We introduce a family of parallel Newton-Krylov-Schwarz methods for solving complementarity problems. The methods are based on a smoothed grid sequencing method, a semismooth inexact Newton method, and a twogrid restricted overlapping Schwarz preconditioner. We show numerically that such an approach is highly scalable in the sense that the number of Newton iterations and the number of linear it...
متن کاملA two-phase algorithm for the multiparametric linear complementarity problem
A new two-phase method for solving the multi-parametric linear complementarity problem (mpLCP) with sufficient matrices is presented. In the first phase an initial feasible solution to mpLCP which satisfies certain criteria is determined. In the second phase the set of feasible parameters is partitioned into polyhedral regions such that the solution of the mpLCP, as a function of the parameters...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2013
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2013-373